A Krylov-schur Approach to the Truncated Svd
نویسنده
چکیده
Computing a small number of singular values is required in many practical applications and it is therefore desirable to have efficient and robust methods that can generate such truncated singular value decompositions. A new method based on the Lanczos bidiagonalization and the Krylov-Schur method is presented. It is shown how deflation strategies can be easily implemented in this method and possible stopping criteria are discussed. Numerical experiments show that existing methods can be outperformed on a number of real world examples. AMS subject classifications. Primary 65F30, 65F50, 65F20 Secondary 92B05
منابع مشابه
Schur method for low-rank matrix approximation
The usual way to compute a low-rank approximant of a matrix H is to take its truncated SVD. However, the SVD is computationally expensive. This paper describes a much simpler generalized Schur-type algorithm to compute similar low-rank approximants. For a given matrix H which has d singular values larger than ε, we find all rank d approximants Ĥ such that H − Ĥ has 2-norm less than ε. The set o...
متن کاملIterative Dual Rational Krylov and Iterative SVD-Dual Rational Krylov Model Reduction for Switched Linear Systems
In this paper, we propose two models reduction algorithms for approximation of large-scale linear switched systems. We present at first the iterative dual rational krylov approach, that construct a union of krylov subspaces. The iterative dual rational Krylov is low in cost, numerical efficient but the stability of reduced system is not always guaranteed. In the second part we present, the iter...
متن کاملA Schur Method for Low-rank Matrix Approximation∗ Alle-jan Van Der Veen
The usual way to compute a low-rank approximant of a matrix H is to take its singular value decomposition (SVD) and truncate it by setting the small singular values equal to 0. However, the SVD is computationally expensive. This paper describes a much simpler generalized Schur-type algorithm to compute similar low-rank approximants. For a given matrix H which has d singular values larger than ε...
متن کاملA Schur Method for Low-Rank Matrix Approximation
The usual way to compute a low-rank approximant of a matrix H is to take its singular value decomposition (SVD) and truncate it by setting the small singular values equal to 0. However, the SVD is computationally expensive. This paper describes a much simpler generalized Schur-type algorithm to compute similar low-rank approximants. For a given matrix H which has d singular values larger than ε...
متن کاملBlock Krylov subspace exact time integration of linear ODE systems. Part 1: algorithm description
We propose a time-exact Krylov-subspace-based method for solving linear ODE (ordinary differential equation) systems of the form y ′ = −Ay+g(t), where y(t) is the unknown function. The method consists of two stages. The first stage is an accurate polynomial approximation of the source term g(t), constructed with the help of the truncated SVD (singular value decomposition). The second stage is a...
متن کامل